If $B$ and $f(B)$ are Brownian motions, then $f$ is affine
نویسندگان
چکیده
منابع مشابه
If intelligence is uncomputable , then ... *
I want to propose an abstract model of the human mind that is, to the human mind, a bit like what a Euclidean rectangle is to a farmers field. I want to show why intelligence, in this model, requires a particular kind of uncomputability the kind that Gold [2] has called computability in the limit. This observation has implications for Computer Science and Cognitive Science if my abstract mod...
متن کاملAre fractional Brownian motions predictable?
We provide a device, called the local predictor, which extends the idea of the predictable compensator. It is shown that a fBm with the Hurst index greater than 1/2 coincides with its local predictor while fBm with the Hurst index smaller than 1/2 does not admit any local predictor. Mathematics Subject Classification (2000). Primary 60G07; Secondary 60G15, 60G48, 60G25.
متن کاملUnitary Brownian Motions Are Linearizable
Brownian motions in the innnite-dimensional group of all unitary operators are studied under strong continuity assumption rather than norm continuity. Every such motion can be described in terms of a countable collection of independent one-dimensional Brownian motions. The proof involves continuous tensor products and continuous quantum measurements. A by-product: a Brownian motion in a separab...
متن کاملContinuous If-Then Statements Are Computable
In many practical situations, we must compute the value of an if-then expression f(x) defined as “if c(x) ≥ 0 then f+(x) else f−(x)”, where f+(x), f−(x), and c(x) are computable functions. The value f(x) cannot be computed directly, since in general, it is not possible to check whether a given real number c(x) is non-negative or non-positive. Similarly, it is not possible to compute the value f...
متن کاملHow good are fuzzy If-Then classifiers?
This paper gives some known theoretical results about fuzzy rule-based classifiers and offers a few new ones. The ability of Takagi-Sugeno-Kang (TSK) fuzzy classifiers to match exactly and to approximate classification boundaries is discussed. The lemma by Klawonn and Klement about the exact match of a classification boundary in R (2) is extended from monotonous to arbitrary functions. Equivale...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 2017
ISSN: 0035-7596
DOI: 10.1216/rmj-2017-47-3-947